On 2-switches and isomorphism classes

نویسنده

  • Michael D. Barrus
چکیده

A 2-switch is an edge addition/deletion operation that changes adjacencies in the graph while preserving the degree of each vertex. A well known result states that graphs with the same degree sequence may be changed into each other via sequences of 2-switches. We show that if a 2-switch changes the isomorphism class of a graph, then it must take place in one of four configurations. We also present a sufficient condition for a 2-switch to change the isomorphism class of a graph. As consequences, we give a new characterization of matrogenic graphs and determine the largest hereditary graph family whose members are all the unique realizations (up to isomorphism) of their respective degree sequences.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distinct Fuzzy Subgroups of a Dihedral Group of Order $2pqrs$ for Distinct Primes $p, , q, , r$ and $s$

In this paper we classify fuzzy subgroups of the dihedral group $D_{pqrs}$  for distinct primes  $p$, $q$, $r$ and $s$. This follows similar work we have done on distinct fuzzy subgroups of some dihedral groups.We present formulae for the number of (i) distinct maximal chains of subgroups, (ii) distinct fuzzy subgroups and (iii) non-isomorphic classes of fuzzy subgroups under our chosen equival...

متن کامل

Improved enumeration of simple topological graphs

A simple topological graph T = (V (T), E(T)) is a drawing of a graph in the plane where every two edges have at most one common point (an endpoint or a crossing) and no three edges pass through a single crossing. Topological graphs G and H are isomorphic if H can be obtained from G by a homeomorphism of the sphere, and weakly isomorphic if G and H have the same set of pairs of crossing edges. W...

متن کامل

The number of Latin squares of order 11

Constructive and nonconstructive techniques are employed to enumerate Latin squares and related objects. It is established that there are (i) 2036029552582883134196099 main classes of Latin squares of order 11; (ii) 6108088657705958932053657 isomorphism classes of one-factorizations of K11,11; (iii) 12216177315369229261482540 isotopy classes of Latin squares of order 11; (iv) 147815745515804445...

متن کامل

On Hypergraph and Graph Isomorphism with Bounded Color Classes

Using logspace counting classes we study the computational complexity of hypergraph and graph isomorphism where the vertex sets have bounded color classes for certain specific bounds. We also give a polynomial-time algorithm for hypergraph isomorphism for bounded color classes of arbitrary size.

متن کامل

Enumeration of isomorphism classes of self-orthogonal Latin squares

The numbers of distinct self-orthogonal Latin squares (SOLS) and idempotent SOLS have been enumerated for orders up to and including 9. The isomorphism classes of idempotent SOLS have also been enumerated for these orders. However, the enumeration of the isomorphism classes of non-idempotent SOLS is still an open problem. By utilising the automorphism groups of class representatives from the al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Mathematics

دوره 312  شماره 

صفحات  -

تاریخ انتشار 2012